Maximal Packing and Minimal Covering of the Complete Bipartite Graph K_ ( m, n) with C_8; 用8长圈C8最大填充和最小覆盖完全二部图K(m,n)
Covering a connected graph with bonds of minimum total size 连通图的极小键覆盖
Minimum Covering Algorithm on Bipartite Graph 偶图求最小覆盖的一种算法
Covering a bipartite graph with independent quadrilaterals 平衡二部图的四圈覆盖
A DNA Solution on Surface for Minimal Vertex Covering Problems of Graph 图的最小顶点覆盖问题的面上DNA解法
Clique Covering Number and Clique Partition Number on the Graph of n Cycle Intermediate Spoke n圈中辐图的团覆盖数和团划分数
In this paper, we research the relations between the maximal independent set and minimal covering set of a graph, and give a general logical and recursive algorithm of maximal independent set and minimal covering set. 本文主要研究了图的极大独立集与极小覆盖集之间的关系,并给出了将图的所有极大独立集与极小覆盖集一次性给出的逻辑及递归算法。
This paper studies the relation between the dominating number of the graph and the covering number of complementary graph. 本文研究了图的控制数与其补图复盖数之间的关系。
Relation Between Arboricity and Clique Covering Number of a Graph 荫度与团覆盖数的关系
On Covering Number and Independence Number of a Self-complementary Graph 自补图的独立数与覆盖数
In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced. 文中把图论里Edmonds定理的树花容量扩展为最小复盖点,并得到了计算非偶图最小复盖点数的公式。
A VC algorithm to obtain the vertex covering of a graph is presented. The VC representative and full closed chain of the graph are defined. 提出求一个图的顶点覆盖的VC算法,定义图的VC表示式及其全闭链的概念。
Then harnessing the conclusion to find a algorithm that starting from the vertices of M-unsaturated and utilizing any maximum matching set M can find one of its minimum covering set in a bipartite graph. 并利用此结论寻求到从偶图的非饱和顶点出发,利用偶图最大匹配求出偶图最小覆盖的一种算法。